نتایج جستجو برای: twin signed total Roman domination number

تعداد نتایج: 1881332  

Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...

2017
Nasrin Dehgardi Lutz Volkmann

Let D be a finite and simple digraph with vertex set V (D). A signed total Roman k-dominating function (STRkDF) on D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−(v) f(x) ≥ k for each v ∈ V (D), where N−(v) consists of all vertices of D from which arcs go into v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The weight o...

Journal: :communication in combinatorics and optimization 0
nasrin dehgardi sirjan university of technology, sirjan 78137, iran lutz volkmann lehrstuhl ii fur mathematik, rwth aachen university, 52056 aachen, germany

let $d$ be a finite and simple digraph with vertex set $v(d)$‎.‎a signed total roman $k$-dominating function (str$k$df) on‎‎$d$ is a function $f:v(d)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each‎‎$vin v(d)$‎, ‎where $n^{-}(v)$ consists of all vertices of $d$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N(v)}f(x)ge 0$ for each‎ ‎$vin V(G)$‎, ‎where $N(v)$ is the open neighborhood of $v$‎, ‎and (ii) every vertex $u$ for which‎ ‎$f(u...

Journal: :Tamkang Journal of Mathematics 2022

Let $G=(V,E)$ be a finite and simple graph of order $n$ maximumdegree $\Delta$. A signed strong total Roman dominating function ona $G$ is $f:V(G)\rightarrow\{-1, 1,2,\ldots, \lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the condition that (i) forevery vertex $v$ $G$, $f(N(v))=\sum_{u\in N(v)}f(u)\geq 1$, where$N(v)$ open neighborhood (ii) every forwhich $f(v)=-1$ adjacent to at least one vertex...

Journal: :Discussiones Mathematicae Graph Theory 2017

A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin V(D)$‎, ‎where $N^{-}(v)$ consists of all vertices of $D$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید